Verifying weak and strong k-step opacity in discrete-event systems

Opacity is an important system-theoretic property expressing whether a system may reveal its secret to passive observer (an intruder) who knows the structure of but has only limited observations behavior. Several notions opacity have been discussed in literature, including current-state opacity, k-step and infinite-step opacity. We investigate weak strong that generalize both ask intruder not able decide, at any time instant, when respectively was state during last k observable steps. design new algorithm verifying complexity which lower than existing algorithms does depend on parameter k, show how use it verify by reducing The resulting again better k.